A Fail-Aware Membership Service

نویسندگان

  • Christof Fetzer
  • Flaviu Cristian
چکیده

We propose a new protocol that can be used to implement a partitionable membership service majority-partition and partitionable membership services for timed asynchronous systems. The protocol is fail-aware in the sense that a process knows at all times if its approximation of the set of processes in its partition is up-to-date or out-of-date. The protocol minimizes wrong suspicions of processes by giving processes a second chance to stay in the membership before they are removed. Our measurements show that the exclusion of alive processes is rare and the crash detection times are good. The protocol guarantees that the memberships of two partitions never overlap.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Derivation of Fail-Aware Membership Service Specifications

We derive the speci cation of a primary partition and a partitionable fail-aware node membership service in a top-down fashion. The derived speci cations are fail-aware in the sense that each client of a membership server can learn if the server currently provides its standard semantics or an exception semantics because too many failures have occurred. We rst propose the speci cation of an idea...

متن کامل

FORTRESS: A System to Support Fail-Aware Real-Time Applications

Fortress is a support system for designing and implementing fault-tolerant distributed real-time systems that use commercial of the shelf (COTS) components. The main problem we address in Fortress is that services cannot always provide their standard properties due the possibility of missed deadlines, dropped messages and process crashes. Fortress allows clients to detect when a service cannot ...

متن کامل

An Efficient Topology-Adaptive Membership Protocol for Large-Scale Network Services

A highly available large-scale service cluster often requires the system to discover new nodes and identify failed nodes quickly in order to handle a high volume of traffic. Determining node membership efficiently in such an environment is critical to location-transparent service invocation, load balancing and failure shielding. In this paper, we present a topology-aware hierarchical membership...

متن کامل

Design and Implementation of a Scalable Membership Service for Supercomputer Resiliency-Aware Runtime

As HPC systems and applications get bigger and more complex, we are approaching an era in which resiliency and run-time elasticity concerns become paramount. We offer a building block for an alternative resiliency approach in which computations will be able to make progress while components fail, in addition to enabling a dynamic set of nodes throughout a computation lifetime. The core of our s...

متن کامل

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Fail-Aware Untrusted Storage

We consider a set of clients collaborating through an online service provider that is subject to at-tacks, and hence not fully trusted by the clients. We introduce the abstraction of a fail-aware un-trusted service, with meaningful semantics even when the provider is faulty. In the common case,when the provider is correct, such a service guarantees consistency (linearizability) and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996